3.3.83 \(\int x^m (a+b x^n)^p (a (1+m+q) x^q+b (1+m+n (1+p)+q) x^{n+q}) \, dx\) [283]

3.3.83.1 Optimal result

Integrand size = 39, antiderivative size = 18 \[ \int x^m \left (a+b x^n\right )^p \left (a (1+m+q) x^q+b (1+m+n (1+p)+q) x^{n+q}\right ) \, dx=x^{1+m+q} \left (a+b x^n\right )^{1+p} \]

output

x^(1+m+q)*(a+b*x^n)^(p+1)
 

3.3.83.2 Mathematica [C] (verified)

Result contains higher order function than in optimal. Order 5 vs. order 3 in optimal.

Time = 0.46 (sec) , antiderivative size = 116, normalized size of antiderivative = 6.44 \[ \int x^m \left (a+b x^n\right )^p \left (a (1+m+q) x^q+b (1+m+n (1+p)+q) x^{n+q}\right ) \, dx=x^{1+m+q} \left (a+b x^n\right )^p \left (1+\frac {b x^n}{a}\right )^{-p} \left (a \operatorname {Hypergeometric2F1}\left (-p,\frac {1+m+q}{n},\frac {1+m+n+q}{n},-\frac {b x^n}{a}\right )+\frac {b (1+m+n+n p+q) x^n \operatorname {Hypergeometric2F1}\left (-p,\frac {1+m+n+q}{n},\frac {1+m+2 n+q}{n},-\frac {b x^n}{a}\right )}{1+m+n+q}\right ) \]

input

Integrate[x^m*(a + b*x^n)^p*(a*(1 + m + q)*x^q + b*(1 + m + n*(1 + p) + q) 
*x^(n + q)),x]
 

output

(x^(1 + m + q)*(a + b*x^n)^p*(a*Hypergeometric2F1[-p, (1 + m + q)/n, (1 + 
m + n + q)/n, -((b*x^n)/a)] + (b*(1 + m + n + n*p + q)*x^n*Hypergeometric2 
F1[-p, (1 + m + n + q)/n, (1 + m + 2*n + q)/n, -((b*x^n)/a)])/(1 + m + n + 
 q)))/(1 + (b*x^n)/a)^p
 

3.3.83.3 Rubi [A] (verified)

Time = 0.16 (sec) , antiderivative size = 18, normalized size of antiderivative = 1.00, number of steps used = 2, number of rules used = 2, \(\frac {\text {number of rules}}{\text {integrand size}}\) = 0.051, Rules used = {10, 951}

Below are the steps used by Rubi to obtain the solution. The rule number used for the transformation is given above next to the arrow. The rules definitions used are listed below.

\(\displaystyle \int x^m \left (a+b x^n\right )^p \left (a (m+q+1) x^q+b x^{n+q} (m+n (p+1)+q+1)\right ) \, dx\)

\(\Big \downarrow \) 10

\(\displaystyle \int x^{m+q} \left (a+b x^n\right )^p \left (a (m+q+1)+b x^n (m+n p+n+q+1)\right )dx\)

\(\Big \downarrow \) 951

\(\displaystyle x^{m+q+1} \left (a+b x^n\right )^{p+1}\)

input

Int[x^m*(a + b*x^n)^p*(a*(1 + m + q)*x^q + b*(1 + m + n*(1 + p) + q)*x^(n 
+ q)),x]
 

output

x^(1 + m + q)*(a + b*x^n)^(1 + p)
 

3.3.83.3.1 Defintions of rubi rules used

rule 10

Int[(u_.)*((e_.)*(x_))^(m_.)*((a_.)*(x_)^(r_.) + (b_.)*(x_)^(s_.))^(p_.), x 
_Symbol] :> Simp[1/e^(p*r)   Int[u*(e*x)^(m + p*r)*(a + b*x^(s - r))^p, x], 
 x] /; FreeQ[{a, b, e, m, r, s}, x] && IntegerQ[p] && (IntegerQ[p*r] || GtQ 
[e, 0]) && PosQ[s - r]
 

rule 951

Int[((e_.)*(x_))^(m_.)*((a_) + (b_.)*(x_)^(n_))^(p_.)*((c_) + (d_.)*(x_)^(n 
_)), x_Symbol] :> Simp[c*(e*x)^(m + 1)*((a + b*x^n)^(p + 1)/(a*e*(m + 1))), 
 x] /; FreeQ[{a, b, c, d, e, m, n, p}, x] && NeQ[b*c - a*d, 0] && EqQ[a*d*( 
m + 1) - b*c*(m + n*(p + 1) + 1), 0] && NeQ[m, -1]
 

3.3.83.4 Maple [F]

\[\int x^{m} \left (a +b \,x^{n}\right )^{p} \left (a \left (1+m +q \right ) x^{q}+b \left (1+m +n \left (1+p \right )+q \right ) x^{n +q}\right )d x\]

input

int(x^m*(a+b*x^n)^p*(a*(1+m+q)*x^q+b*(1+m+n*(1+p)+q)*x^(n+q)),x)
 

output

int(x^m*(a+b*x^n)^p*(a*(1+m+q)*x^q+b*(1+m+n*(1+p)+q)*x^(n+q)),x)
 

3.3.83.5 Fricas [B] (verification not implemented)

Leaf count of result is larger than twice the leaf count of optimal. 43 vs. \(2 (18) = 36\).

Time = 0.28 (sec) , antiderivative size = 43, normalized size of antiderivative = 2.39 \[ \int x^m \left (a+b x^n\right )^p \left (a (1+m+q) x^q+b (1+m+n (1+p)+q) x^{n+q}\right ) \, dx={\left (b x x^{m} x^{n + q} + a x x^{m} x^{q}\right )} \left (\frac {b x^{n + q} + a x^{q}}{x^{q}}\right )^{p} \]

input

integrate(x^m*(a+b*x^n)^p*(a*(1+m+q)*x^q+b*(1+m+n*(1+p)+q)*x^(n+q)),x, alg 
orithm="fricas")
 

output

(b*x*x^m*x^(n + q) + a*x*x^m*x^q)*((b*x^(n + q) + a*x^q)/x^q)^p
 

3.3.83.6 Sympy [F(-1)]

Timed out. \[ \int x^m \left (a+b x^n\right )^p \left (a (1+m+q) x^q+b (1+m+n (1+p)+q) x^{n+q}\right ) \, dx=\text {Timed out} \]

input

integrate(x**m*(a+b*x**n)**p*(a*(1+m+q)*x**q+b*(1+m+n*(1+p)+q)*x**(n+q)),x 
)
 

output

Timed out
 

3.3.83.7 Maxima [B] (verification not implemented)

Leaf count of result is larger than twice the leaf count of optimal. 37 vs. \(2 (18) = 36\).

Time = 0.27 (sec) , antiderivative size = 37, normalized size of antiderivative = 2.06 \[ \int x^m \left (a+b x^n\right )^p \left (a (1+m+q) x^q+b (1+m+n (1+p)+q) x^{n+q}\right ) \, dx={\left (a x x^{m} + b x e^{\left (m \log \left (x\right ) + n \log \left (x\right )\right )}\right )} e^{\left (p \log \left (b x^{n} + a\right ) + q \log \left (x\right )\right )} \]

input

integrate(x^m*(a+b*x^n)^p*(a*(1+m+q)*x^q+b*(1+m+n*(1+p)+q)*x^(n+q)),x, alg 
orithm="maxima")
 

output

(a*x*x^m + b*x*e^(m*log(x) + n*log(x)))*e^(p*log(b*x^n + a) + q*log(x))
 

3.3.83.8 Giac [B] (verification not implemented)

Leaf count of result is larger than twice the leaf count of optimal. 48 vs. \(2 (18) = 36\).

Time = 0.33 (sec) , antiderivative size = 48, normalized size of antiderivative = 2.67 \[ \int x^m \left (a+b x^n\right )^p \left (a (1+m+q) x^q+b (1+m+n (1+p)+q) x^{n+q}\right ) \, dx={\left (b x^{n} + a\right )}^{p} b x x^{n} e^{\left (m \log \left (x\right ) + q \log \left (x\right )\right )} + {\left (b x^{n} + a\right )}^{p} a x e^{\left (m \log \left (x\right ) + q \log \left (x\right )\right )} \]

input

integrate(x^m*(a+b*x^n)^p*(a*(1+m+q)*x^q+b*(1+m+n*(1+p)+q)*x^(n+q)),x, alg 
orithm="giac")
 

output

(b*x^n + a)^p*b*x*x^n*e^(m*log(x) + q*log(x)) + (b*x^n + a)^p*a*x*e^(m*log 
(x) + q*log(x))
 

3.3.83.9 Mupad [F(-1)]

Timed out. \[ \int x^m \left (a+b x^n\right )^p \left (a (1+m+q) x^q+b (1+m+n (1+p)+q) x^{n+q}\right ) \, dx=\int x^m\,\left (a\,x^q\,\left (m+q+1\right )+b\,x^{n+q}\,\left (m+q+n\,\left (p+1\right )+1\right )\right )\,{\left (a+b\,x^n\right )}^p \,d x \]

input

int(x^m*(a*x^q*(m + q + 1) + b*x^(n + q)*(m + q + n*(p + 1) + 1))*(a + b*x 
^n)^p,x)
 

output

int(x^m*(a*x^q*(m + q + 1) + b*x^(n + q)*(m + q + n*(p + 1) + 1))*(a + b*x 
^n)^p, x)